Perfect powers in sum of three fifth powers
نویسندگان
چکیده
In this paper we determine the perfect powers that are sums of three fifth in an arithmetic progression. More precisely, completely solve Diophantine equation(x−d)5+x5+(x+d)5=zn,n≥2, where d,x,z∈Z and d=2a5b with a,b≥0.
منابع مشابه
Perfect Powers with Three Digits
We solve the equation xa + xb + 1= yq in positive integers x, y, a, b and q with a > b and q > 2 coprime to φ(x). This requires a combination of a variety of techniques from effective Diophantine approximation, including lower bounds for linear forms in complex and p-adic logarithms, the hypergeometric method of Thue and Siegel applied p-adically, local methods, and the algorithmic resolution o...
متن کاملPerfect Matchings and Perfect Powers
In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers (N. Elkies et al., J. Algebraic Combin. 1 (1992), 111– 132; B.-Y. Yang, Ph.D. thesis, Department of Mathematics, MIT, Cambridge, MA, 1991; J. Propp, New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999). In this pa...
متن کاملPowers of Two Modulo Powers of Three
Since 2 is a primitive root of 3 for each positive integer m, the set of points {(n, 2 mod 3) : n > 0}, viewed as a subset of Z>0×Z>0 is bi-periodic, with minimal periods φ(3) (horizontally) and 3 (vertically). We show that if one considers the classes of n modulo 6, one obtains a finer structural classification. This result is presented within the context of the question of strong normality of...
متن کاملSparse Perfect Powers
We examine the problem of detecting when a given sparse polynomial f is equal to hr for some other polynomial h and integer r ≥ 2. In this case we say f is a perfect power, and h is its r th root. We give randomized algorithms to detect when f is a perfect power, by repeatedly evaluating the polynomial in specially-chosen finite fields and checking whether the evaluations are themselves perfect...
متن کاملDifferences between Perfect Powers
We apply the hypergeometric method of Thue and Siegel to prove, if a and b are positive integers, that the inequality 0 < |a − b | < 1 4 max{a, b} has at most a single solution in positive integers x and y. This essentially sharpens a classic result of LeVeque.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2022
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2021.07.029